Revisiting Proactive Secret Sharing Based on Shamir’s Scheme

نویسندگان

  • Sonali Patil
  • Nikita Rana
  • Dhara Patel
  • Prajol Hodge
چکیده

The Secret Sharing scheme assumes long-lived shares. However the protection provided for such long lived and sensitive shares may be insufficient. The security in a system that is exposed to attacks and break-ins might become exhausted. The goal of the pro-active security scheme is to prevent the adversary from learning the secret or from destroying it. The Shamir’s Secret Sharing is pioneer method for secret sharing. Due to its security in information theoretic sense compare to many secret sharing methods researchers found it more useful and interesting. In this paper a novel proactive secret sharing scheme for image is proposed based on Shamir’s secret sharing. The proposed schemes provides the extended capabilities for proactiveness like adding new shareholder, removing shareholder and renewing shares and recover lost or corrupted shares.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Proactive Secret Sharing Scheme in matrix projection method

Proactive Secret Sharing (PSS) scheme is a method to periodically renew n secret shares in a (k, n) threshold-based Secret Sharing Scheme (SSS) without modifying the secret, or reconstructing the secret to reproduce new shares. Traditionally, PSS schemes are developed for the Shamir’s SSS which is a single SSS. Bai (2006) developed a multiple-secret sharing scheme using matrix projection. This ...

متن کامل

Asynchronous Secret Reconstruction and Its Application to the Threshold Cryptography

In Shamir’s ( ) t n , threshold of the secret sharing scheme, a secret s is divided into n shares by a dealer and is shared among n shareholders in such a way that (a) the secret can be reconstructed when there are t or more than t shares; and (b) the secret cannot be obtained when there are fewer than t shares. In the secret reconstruction, participating users can be either legitimate sharehol...

متن کامل

Verifiable Secret Sharing Scheme Based on Integer Representation

In Shamir’s scheme that the security based on the numbers of the field of a prime number P which the coefficients' polynomial reduced to modulo P (takes a value from some field p Z , where P is a large prime number). Thus, the adversary must know only the free coefficient of the polynomial in order to break the scheme. Our scheme which based on representation integer using the so-called g a d i...

متن کامل

Fair secret reconstruction in (t, n) secret sharing

In Shamir’s (t, n) threshold secret sharing scheme, one secret s is divided into n shares by a dealer and all shares are shared among n shareholders, such that knowing t or more than t shares can reconstruct this secret; but knowing fewer than t shares cannot reveal any information about the secret s. The secret reconstruction phase in Shamir’s (t, n) threshold secret sharing is very simple and...

متن کامل

Secure secret reconstruction and multi-secret sharing schemes with unconditional security

In Shamir’s (t, n) secret sharing (SS) scheme, the secret s is divided into n shares by a dealer and is shared among n shareholders in such a way that any t or more than t shares can reconstruct this secret; but fewer than t shares cannot obtain any information about the secret s. In this paper, we will introduce the security problem that an adversary can obtain the secret when there are more t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013